Iterated arc graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterated colorings of graphs

For a graph property P, in particular maximal independence, minimal domination and maximal irredundance, we introduce iterated P-colorings of graphs. The six graph parameters arising from either maximizing or minimizing the number of colors used for each property, are related by an inequality chain, and in this paper we initiate the study of these parameters. We relate them to other well-studie...

متن کامل

Iterated neighborhood graphs

The neighborhood graph N(G) of a simple undirected graph G = (V,E) is the graph (V,EN ) where EN = {{a, b} | a 6= b , {x, a} ∈ E and {x, b} ∈ E for some x ∈ V }. It is well-known that the neighborhood graph N(G) is connected if and only if the graph G is connected and non-bipartite. We present some results concerning the k-iterated neighborhood graph N(G) := N(N(. . . N(G))) of G. In particular...

متن کامل

D-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs

The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...

متن کامل

Dismantlings and iterated clique graphs

Given a graph G and two vertices x, y ∈ V (G), we say that x is dominated by y if the closed neighbourhood of x is contained in that of y. Here we prove that if x is a dominated vertex, then G and G− {x} have the same dynamical behaviour under the iteration of the clique operator.

متن کامل

Planarity of iterated line graphs

The line index of a graph G is the smallest k such that the kth iterated line graph of G is nonplanar. We show that the line index of a graph is either infinite or it is at most 4. Moreover, we give a full characterization of all graphs with respect to their line index. © 2007 Elsevier B.V. All rights reserved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Commentationes Mathematicae Universitatis Carolinae

سال: 2018

ISSN: 0010-2628,1213-7243

DOI: 10.14712/1213-7243.2015.260